Envy Quotes and the Iterated Core-Selecting Combinatorial Auction
نویسندگان
چکیده
Using a model of agent behavior based around envy-reducing strategies, we describe an iterated combinatorial auction in which the allocation and prices converge to a solution in the core of the agents’ true valuations. In each round of the iterative auction mechanism, agents act on envy quotes produced by the mechanism: hints that suggest the prices of the bundles they are interested in. We describe optimal methods of generating envy quotes for two different core-selecting mechanisms. Prior work on core-selecting combinatorial auctions has required agents to have perfect information about every agent’s valuations to achieve a solution in the core. In contrast, here a core solution is reached even in the private infor-
منابع مشابه
Selecting Efficient Service-providers in Electric Power Distribution Industry Using Combinatorial Reverse Auction
In this paper, a combinatorial reverse auction mechanism is proposed for selecting the most efficient service-providers for resolving sustained power interruptions in multiple regions of an electric power distribution company’s responsibility area. Through this mechanism, supplying the required service in each region is assigned to only one potential service-provider considering two criteria in...
متن کاملGeneralizing Envy-Freeness toward Group of Agents
Envy-freeness is a well-known fairness concept for analyzing mechanisms. Its traditional definition requires that no individual envies another individual. However, an individual (or a group of agents) may envy another group, even if she (or they) does not envy another individual. In mechanisms with monetary transfer, such as combinatorial auctions, considering such fairness requirements, which ...
متن کاملRisk aversion and loss aversion in core-selecting auctions
Core-selecting combinatorial auctions have been introduced as an alternative to the Vickrey-Clarke-Groves (VCG) mechanism because VCG results in payments that are not in the core with respect to bids, leading to unfair payments, unacceptably low revenues, and unstable outcomes. This raises an auction selection problem for an auctioneer deciding whether to employ a core-selecting auction or VCG ...
متن کاملCore-Selecting Payment Rules for Combinatorial Auctions with Uncertain Availability of Goods
In some auction domains, there is uncertainty regarding the final availability of the goods being auctioned off. For example, a government may auction off spectrum from its public safety network, but it may need this spectrum back in times of emergency. In such a domain, standard combinatorial auctions perform poorly because they lead to violations of individual rationality (IR), even in expect...
متن کاملDo Core-Selecting Combinatorial Clock Auctions always lead to high Efficiency? An Experimental Analysis of Spectrum Auction Designs
For many years the Simultaneous Multi-Round Auction (SMRA) has been the primary auction design for spectrum sales worldwide. Recently, the core-selecting Combinatorial Clock Auction (CCA) has been used as an alternative to the SMRA in a number of countries promising strong incentives for truthful bidding and high efficiency as a result. We analyze the efficiency and auctioneer revenue of the CC...
متن کامل